RDT+: A parameter-free algorithm for exact motion planning

نویسندگان

  • Nikolaus Vahrenkamp
  • Peter Kaiser
  • Tamim Asfour
  • Rüdiger Dillmann
چکیده

In this paper parameter-free concepts for exact motion planning are investigated. With the proposed RDT approach the collision detection parameters of a Rapidlyexploring Dense Tree (RDT) are automatically adjusted until an exact solution can be found. For efficient planning discrete collision detection routines are used within the RDT planner and by verifying the results with exact collision detection methods, the RDT concept allows to compute motions that are guaranteed collision-free. We show the probabilistic completeness of the proposed planner and present an extension for handling narrow passages. The algorithms are evaluated in different experiments, including narrow passages and high-dimensional planning problems, that are solved in simulation and on the humanoid robot ARMAR-III.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effect of Step Length and Step Period on Walking Speed and Energy Consumption: a Parameter Study

Stability and performance are two main issues in motion of bipeds. To ensure stability of motion, a biped needs to follow specific pattern to comply with a stability criterion such as zero moment point. However, there are infinity many patterns of motion which ensure stability, so one might think of achieving better performance by choosing proper parameters of motion. Step length and step perio...

متن کامل

Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs

In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...

متن کامل

Motion planning amidst fat obstacles

The complexity of exact motion planning algorithms highly depends on the complexity of the robot’s free space, i.e., the set of all collision-free placements of the robot. Theoretically, the complexity of the free space can be very high. In practice, the complexity of the free space tends to be much smaller. We show that, under some realistic assumptions, the complexity of the free space of a r...

متن کامل

Efficient Local Planning using Connection Collision Query

We introduce a novel proximity query, called connection collision query (CCQ), and use it for efficient and exact local planning in sampling-based motion planners. Given two collision-free configurations, CCQ checks whether these configurations can be connected by a given continuous path that either lies completely in the free space or penetrates any obstacle by at most ε , a given threshold. O...

متن کامل

Efficient Algorithms for Exact

The complexity of exact motion planning algorithms highly depends on the complexity of the robot’s free space, i.e., the set of all collision-free placements of the robot. Theoretically, the complexity of the free space can be very high. In practice, the complexity of the free space tends to be much smaller. We show that, under some realistic assumptions, the complexity of the free space of a r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011